The Hamiltonian problem and t-path traceable graphs
نویسندگان
چکیده
منابع مشابه
Partitioning powers of traceable or hamiltonian graphs
A graph G = (V,E) is arbitrarily partitionable (AP) if for any sequence τ = (n1, . . . , np) of positive integers adding up to the order of G, there is a sequence of mutually disjoints subsets of V whose sizes are given by τ and which induce connected graphs. If, additionally, for given k, it is possible to prescribe l = min{k, p} vertices belonging to the first l subsets of τ , G is said to be...
متن کاملTraceability of locally hamiltonian and locally traceable graphs
If P is a given graph property, we say that a graph G is locally P if 〈N(v)〉 has property P for every v ∈ V (G) where 〈N(v)〉 is the induced graph on the open neighbourhood of the vertex v. Pareek and Skupień (C. M. Pareek and Z. Skupień, On the smallest non-Hamiltonian locally Hamiltonian graph, J. Univ. Kuwait (Sci.), 10:9 17, 1983) posed the following two questions. Question 1 Is 9 the smalle...
متن کاملThe Hamiltonian Alternating Path Problem
In this paper, we consider the Hamiltonian alternating path problem for graphs, multigraphs, and digraphs. We describe an approach to solve the problem. This approach is based on constructing logical models for the problem. We use logical models for the Hamiltonian alternating path problem to solve the Hamiltonian path problem and the planning a typical working day for indoor service robots pro...
متن کاملMetaheuristics for the Asymmetric Hamiltonian Path Problem
One of the most important applications of the Asymmetric Hamiltonian Path Problem is in scheduling. In this paper we describe a variant of this problem, and develop both a mathematical programming formulation and simple metaheuristics for solving it. The formulation is based on a transformation of the input data, in such a way that a standard mathematical programming model for the Asymmetric Tr...
متن کاملOn k-path Hamiltonian planar graphs
We give a simple upper bound on k for k-path-hamiltonianness of a graph. Also given are exact values for maximal planar graphs. UN/VERSJTY LIBRARIES CARNEGIE-MELLON UNIVERSITY PITTSBURGH, PENNSYLVANIA 15213
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Involve, a Journal of Mathematics
سال: 2017
ISSN: 1944-4184,1944-4176
DOI: 10.2140/involve.2017.10.801